As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players – they are games of simultaneous moves. For many settings, this is clearly unrealistic. In this paper, we show how Boolean games can be enriched by dependency graphs which explicitly represent the informational dependencies between variables in a game. More precisely, dependency graphs play two roles. First, when we say that variable x depends on variable y, then (...) we mean that when a strategy assigns a value to variable x, it can be informed by the value that has been assigned to y. Second, and as a consequence of the first property, they capture a richer and more plausible model of concurrency than the simultaneous-action model implicit in conventional Boolean games. Dependency graphs implicitly define a partial ordering of the run-time events in a game: if x is dependent on y, then the assignment of a value to y must precede the assignment of a value to x; if x and y are independent, however, then we can say nothing about the ordering of assignments to these variables—the assignments may occur concurrently. We refer to Boolean games with dependency graphs as partial-order Boolean games. After motivating and presenting the partial-order Boolean games model, we explore its properties. We show that while some problems associated with our new games have the same complexity as in conventional Boolean games, for others the complexity blows up dramatically. We also show that the concurrency in partial-order Boolean games can be modelled using a closure-operator semantics, and conclude by considering the relationship of our model to Independence-Friendly logic. (shrink)

Temporal logic can be used to describe processes: their behaviour ischaracterized by a set of temporal models axiomatized by a temporaltheory. Two types of models are most often used for this purpose: linearand branching time models. In this paper a third approach, based onsocalled joint closure models, is studied using models which incorporateall possible behaviour in one model. Relations between this approach andthe other two are studied. In order to define constructions needed (...) torelate branching time models, appropriate algebraic notions are defined(in a category theoretical manner) and exploited. In particular, thenotion of joint closure is used to construct one model subsuming a setof models. Using this universal algebraic construction we show that aset of linear models can be merged to a unique branching time model.Logical properties of the described algebraic constructions are studied.The proposed approach has been successfully aplied to obtain anappropriate semantics for non-monotonic reasoning processes based ondefault logic. References are discussed that show the details of theseapplications. (shrink)

This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica (...) 39 257–274] for nondeterministic sequential programs, and by Peleg [D. Peleg, Concurrent dynamic logic, Journal of the Association for Computing Machinery 34 , D. Peleg, Communication in concurrent dynamic logic, Journal of Computer and System Sciences 35 ] for concurrent programs, for the purpose of proving properties of programs such as correctness. Here we define what it means for a dynamic logic formula to be forced to be true knowing only partial information about the results of assignments and tests. This informal CCDL semantics is formalized by intuitionistic Kripke frames modeling this partial information, and each such frame is interpreted as an idealized concurrent machine . In CCDL, proofs and deductions are ω-height, ω-branching, well-founded labeled subtrees of ωω. These are a generalization of the signed tableaux of Nerode [A. Nerode, Some lectures in modal logic, Technical Report, M.S.I. Cornell University, 1989, CIME Logic and Computer Science Montecatini Volume, Springer-Verlag Lecture Notes, 1990, A. Nerode, Some lectures in intuitionistic logic, Technical Report, M.S.I. Cornell University, 1988, Marktoberdorf Logic and Computation NATO Summer School Volume, NATO Science Series, 1990 ] stemming from the prefix tableaux of Fitting [M.C. Fitting, Proof Methods for Modal and Intuitionistic Logic, Reidel, 1983]. We demonstrate the correctness of our tableau proofs, define consistency properties, prove that consistency properties yield models, construct systematic tableaux, prove that systematic tableaux yield a consistency property, and conclude that CCDL is complete. This infinitary semantics and proof procedure will be the primary guide for defining, in a sequel, the correct finitary CCDL based on induction principles. FCCDL is suitable for implementation in constructive logic software systems such as Constable’s NUPRL or Huet-Coquand’s CONSTRUCTIONS. Our goal is to develop a constructive logic programming tool for specification and modular verification of programs in any imperative concurrent language, and for the extraction of concurrent programs from constructive proofs. Subsequent papers will introduce analogous logics for declarative and functional concurrent languages. (shrink)

Weak ontic necessity is the ontic necessity expressed by “should” or “ought to”. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds is irrelevant to whether its underlying proposition holds. This necessity essentially involves time. This paper presents a logic for conditional weak ontic necessity in branching time. The logic’s language includes the next instant operator, the last instant operator, and the operator for conditional weak (...) ontic necessity. Formulas are evaluated at tuples consisting of a tree-based model, a context, a timeline, and an instant. A context is a set of ordered ontic laws determining expected timelines. When evaluating conditional weak ontic necessity, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We discuss some consequences of the formalization and compare it to some related work. We study the logic’s expressivity and axiomatize a special validity of it. (shrink)

While the Value-Free Ideal (VFI) had many precursors, it became a solidified bulwark of normative claims about scientific reasoning and practice in the mid-twentieth century. Since then, it has played a central role in the philosophy of science, first as a basic presupposition of how science should work, then as a target for critique, and now as a target for replacement. In this paper, we will argue that a narrow focus on the VFI is misguided, because the VFI coalesced in (...) the midst of other important shifts in the relationship between science and society. In particular, the mid-twentieth century saw the acceptance of the “social contract for science,” a tacit agreement between scientists and government officials, and more broadly between science and society. It was built around three core concepts: a distinction between basic and applied science, a conception of scientific freedom that limited social responsibility for scientists, and a justification for public funding of basic science in the form of the linear model. Within the conceptual framework of the social contract for science, it is clearer both (1) why the VFI was adopted, (2) why it is difficult to replace the VFI within the old social contract, and (3) how we need to revise the social contract for science in order to replace the VFI. (shrink)

We study belief change in the branching-time structures introduced in Bonanno (Artif Intell 171:144–160, 2007 ). First, we identify a property of branching-time frames that is equivalent (when the set of states is finite) to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision function that satisfies (...) the AGM postulates. Second, we provide a set of modal axioms that characterize the class of AGM-consistent frames within the modal logic introduced in Bonanno (Artif Intell 171:144–160, 2007 ). Third, we introduce a generalization of AGM belief revision functions that allows a clear statement of principles of iterated belief revision and discuss iterated revision both semantically and syntactically. (shrink)

This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combinations, in various degrees, of languages and semantics for linear time with (...) a modality for possible paths. We then consider a hierarchy of natural classes of trees and bundled trees arising from a given class of linear orders and show that in general they provide different semantics. We also discuss transfer of definability from linear orders to trees and introduce a uniform translation from Priorean to Peircean formulae which transfers definability of properties of linear orders to definability of properties of all paths in trees. (shrink)

In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial (...) class='Hi'>time. Additionally, we suggest that plausible semantic theories of the everyday fragment of natural language can be formulated in the existential fragment of second-order logic. -/- In Chapter 2 we give an overview of the basic notions of generalized quantifier theory, computability theory, and descriptive complexity theory. -/- In Chapter 3 we prove that PTIME quantifiers are closed under iteration, cumulation and resumption. Next, we discuss the NP-completeness of branching quantifiers. Finally, we show that some Ramsey quantifiers define NP-complete classes of finite models while others stay in PTIME. We also give a sufficient condition for a Ramsey quantifier to be computable in polynomial time. -/- In Chapter 4 we investigate the computational complexity of polyadic lifts expressing various readings of reciprocal sentences with quantified antecedents. We show a dichotomy between these readings: the strong reciprocal reading can create NP-complete constructions, while the weak and the intermediate reciprocal readings do not. Additionally, we argue that this difference should be acknowledged in the Strong Meaning hypothesis. -/- In Chapter 5 we study the definability and complexity of the type-shifting approach to collective quantification in natural language. We show that under reasonable complexity assumptions it is not general enough to cover the semantics of all collective quantifiers in natural language. The type-shifting approach cannot lead outside second-order logic and arguably some collective quantifiers are not expressible in second-order logic. As a result, we argue that algebraic (many-sorted) formalisms dealing with collectivity are more plausible than the type-shifting approach. Moreover, we suggest that some collective quantifiers might not be realized in everyday language due to their high computational complexity. Additionally, we introduce the so-called second-order generalized quantifiers to the study of collective semantics. -/- In Chapter 6 we study the statement known as Hintikka's thesis: that the semantics of sentences like ``Most boys and most girls hate each other'' is not expressible by linear formulae and one needs to use branching quantification. We discuss possible readings of such sentences and come to the conclusion that they are expressible by linear formulae, as opposed to what Hintikka states. Next, we propose empirical evidence confirming our theoretical predictions that these sentences are sometimes interpreted by people as having the conjunctional reading. -/- In Chapter 7 we discuss a computational semantics for monadic quantifiers in natural language. We recall that it can be expressed in terms of finite-state and push-down automata. Then we present and criticize the neurological research building on this model. The discussion leads to a new experimental set-up which provides empirical evidence confirming the complexity predictions of the computational model. We show that the differences in reaction time needed for comprehension of sentences with monadic quantifiers are consistent with the complexity differences predicted by the model. -/- In Chapter 8 we discuss some general open questions and possible directions for future research, e.g., using different measures of complexity, involving game-theory and so on. -/- In general, our research explores, from different perspectives, the advantages of identifying meaning with algorithms and applying computational complexity analysis to semantic issues. It shows the fruitfulness of such an abstract computational approach for linguistics and cognitive science. (shrink)

Branching space-times (BST; Belnap, Synthese 92:385–434, 1992 ) is the most advanced formal framework for representing indeterminism. BST is however based on continuous partial orderings, while our natural way of describing indeterministic scenarios may be called discrete. This paper establishes a theorem providing a discrete data format for BST: it is proved that a discrete representation of indeterministic scenarios leading to BST models is possible in an important subclass of cases. This result enables the representation of limited (...) indeterminism in BST and hopefully paves the way for the representation of substances with capacities in that framework. (shrink)

In this thesis I investigate the notion of experience in German Idealist Philosophy. I focus on the exploration of an alternative to the transcendental model notion of experience through Schelling's insight into the notion of logogrif. The structural division of this project into two sections reflects the two theoretical standpoints of this project, namely the logic and the logogrif of experience. The first section - the logic of experience - explores the notion of experience provided in Kant's Critique of Pure (...) Reason, Critique of Judgement and Fichte's Science of Knowledge. I argue that Kant's fundamental question about the possibility of synthetic a priori judgements succeeds in thematising the aporia of cognitive experience but results in a subject-oriented, representational model which radically confines the notion of experience to the constitutive laws of the understanding or to the normative precepts of Reason. Experience is founded upon a sharp division between faith and knowledge, will and logic, desire and reflection, absolute and finitude. Fichte's endeavour to articulate a non-representational account of experience, does not succeed in extricating itself from the representational model, so long as experience is reduced to the ever-producing deeds of the self-positing ego. Despite the serious differences between Kant's and Fichte's notions of experience, both accounts, so long as they unfold from a transcendental standpoint, attempt to resolve experience into conceptual laws or determinations of the ego's absolute will. Experience is transformed into an object of the subject's cognitive or volitional faculties. The paradoxes of man's interaction with the world are intended to be accommodated either by the law-giving spontaneity of the understanding and the Architectonic of Pure Reason or by the overpowerful primordial act of the self-positing ego. This implies the conceptualisation of the self in terms of constant identity-through-time, or sheer self-determination. However, this conceptualisation remains at the normative or prescriptive level, which in turn is projected upon the world. The latter, though appears as the subject's property, essentially remains alien and opaque, confirming the radical limitations of the ego rather than its order-giving authority. Moreover, this notion of experience is ultimately founded upon a radical expulsion of the divine from the world, the de-spiritualisation of the sensual and the de-sensualisation of the spiritual, the sharp juxtaposition between absolute and finitude. This results in a self-defeating subjectivity, whose firm identity and rule-giving authority does not rescue it from its perennial unattainability to 'organise the conditioned' or 'conquer the unconditioned'. In Kant's and Fichte's thought, however, I detect elements that potentially transgress their transcendental account of experience. These are found in Kant's concept of spontaneity and free play between understanding and imagination, and Fichte's concept of productivity. I argue that these elements lose their potential dynamism, so long as they are absorbed by the transcendental demands for the solution of the aporias of logic. However, these elements point to the need for a radical re-conceptualisation of the notion of experience. This is provided by means of Schelling's logogriflic approach, which constitutes the theme of the second section. The second section - the logogrif of experience - attempts to articulate a different approach towards the notion of experience, through an exploration of Schelling's versatile and provocative thought. This section focuses on Schelling's original insight into the notion and act of logogrif, which opens the dialogue between logos and mythos, cosmic becoming and human soul, cosmic imagination and human reflection, faith and knowledge. This section attempts to illuminate Schelling's fascinating philosophical investigations and discoveries that have been rather overlooked, possibly, due to Hegel's overwhelming critique. This section, after a brief critical examination of the Identity Philosophy, attempts to elucidate Schelling's notion of experience through his middle works, Of Human Freedom, Ages of the World, The Deities of Samothrace, which are treated as a self-developing trilogy. Schelling re-addresses the aporias of logic not as part of Reason's self-interrogation but as part of the cosmic paradoxes and living experiences. In this way, Schelling resets the scene of the debate on the conditions of possibility for cognitive experience by putting on the stage the enigmas of the cosmos and life rather than the Tribunal of Reason. Logic itself is conceived as a potency in the cosmic becoming, and consequently can no longer attempt to establish the transcendental conditions for the possibility of cognitive experience. Cosmic becoming, in which man is an active part, is conceived as the process of the movement, the interaction, the transformations and transmutations of multiple potencies. These, far beyond any mechanical conceptualisation, appear as self-moving and yet interdependent, unknown yet familiar, inscrutable and yet manifest powers, describing the mystery of life itself. The latter is depicted as an ever-recurrent act of longing for self-expression as active unity. Experience is conceived as the lived process of a network of living potencies, which may not only resist rational powers but may also puzzle and seize them. In this context, reflection acquires a plastic dimension, as opposed to its rigidity in the representational model of experience. Reflection depicts cosmic longing's self-formation, whose man is part. This self-bending formation partially illuminates the nature of longing, and from this standpoint is the logic of the longing. However, this formation is movable, transmutable and mostly ineffable, and from this standpoint is the logic of a riddle: a logogrif. Logogrif is the transitive term that attempts to describe the transition of experience from its enacted phase to its allusive conceptual utterance, and in this sense the term itself participates in both phases, as both form of thought and form of life. The logogrific approach to experience in turn transposes us as from the realm of pure concepts to the realm of the mystery of life, from pure thought to acts of longing, from the Architectonic of Pure Reason to Cosmic Theurgy. The latter term attempts to grasp the paradox and dynamism of cosmic and non-cosmic becoming by means of multiple, vanishing and ever-recurring, transmutable potencies, or in Schelling's terms 'the magic of insoluble life'. Schelling's logogrific account consists in a powerful voice for the re-enchantment of the world, the introduction into the notion of experience of the imminence of the divine. This is not suggested in terms of the adoption of old religious doctrines but by means of the discovery and re-discovery of the theurgy of life, through the intensification of our artistic mood, the creative expansion of our deeds. This notion of experience allows for the reconsideration of the notion of the self, in terms of a dynamic, conflictual process between conscious and unconscious powers and the critical revaluation of the accounts of subjectivity which reduce it to the sphere of self-consciousness. The thesis concludes with the need for an investigation into the relation between logos and mythos, which only tangentially has been introduced by the present project. In this context it will be possible to re-appraise the potential that the logogrific approach opens for an alternative to both logical and traditional mythological patterns of thinking. (shrink)

In Ockhamist branching-time logic [Prior 67], formulas are meant to be evaluated on a specified branch, or history, passing through the moment at hand. The linguistic counterpart of the manifoldness of future is a possibility operator which is read as `at some branch, or history (passing through the moment at hand)'. Both the bundled-trees semantics [Burgess 79] and the $\langle moment, history\rangle$ semantics [Thomason 84] for the possibility operator involve a quantification over sets of moments. The Ockhamist frames (...) are (3-modal) Kripke structures in which this second-order quantification is represented by a first-order quantification. The aim of the present paper is to investigate the notions of modal definability, validity, and axiomatizability concerning 3-modal frames which can be viewed as generalizations of Ockhamist frames. (shrink)

Expert knowledge regularly informs personal and civic-decision making. To decide which experts to trust, lay publics —including policymakers and experts from other domains—use different epistemic and non-epistemic cues. Epistemic cues such as honesty, like when experts are forthcoming about conflicts of interest, are a popular way of understanding how people evaluate and decide which experts to trust. However, many other epistemic cues, like the evidence supporting information from experts, are inaccessible to lay publics. Therefore, lay publics simultaneously use second-order (...) social cues in their environment to inform decisions to trust. These second-order social cues, or ‘social indicators of trust’, prevent lay publics from having to trust blindly. Social indicators of trust therefore inform lay publics’ epistemic vigilance, or constant low level-monitoring of testimony from experts. This special issue examines the nature, acquisition and application of social indicators of trust for scientific experts and institutions. It also raises questions about the types of trust asked of lay publics and challenges traditional normative assumptions about the relationship between science and lay publics through study of attitudes, values, and experiences. The issue descriptively re-examines the structure of institutions, their role and methods for ferrying information, as well as how social indicators operate in times of crisis. In this collection of works, we bridge history, science, philosophy of science, science and technology studies, science communication and social epistemology, to broaden the discourse on trust in experts and more accurately reflect the imperfect yet indispensable endeavour that trusting is. (shrink)

The basic principles of Cipra's metaphysics (according to his book "Metamorphoses of Metaphysics") are analyzed with respect to Cipra's request for the revision of classical logical principles (of identity, excluded middle and contradiction). In Cipra's metaphysics, the principle of identity holds for being, necessity and past only, the principle of excluded middle does not hold for coming-to-be, possibility and present, and the principle of contradiction does not hold for the actuality, reality (freedom) and future. A propositional and first-order temporal (...) model and semantics are defined for such a concept of metaphysical time. The propositional ockhamistic branching time model is extended, in a first-order model, with a non-empty set of object shapes and an equivalence relation between object shapes in time, so that, for example, different, previously equivalent object shapes can in future contradict one another. (shrink)

This thesis focuses on models of conceptual change in science and philosophy. In particular, I developed a new bootstrapping methodology for studying conceptual change, centered around the formalization of several popular models of conceptual change and the collective assessment of their improved formal versions via nine evaluative dimensions. Among the models of conceptual change treated in the thesis are Carnap’s explication, Lakatos’ concept-stretching, Toulmin’s conceptual populations, Waismann’s open texture, Mark Wilson’s patches and facades, Sneed’s structuralism, and Paul (...) Thagard’s conceptual revolutions. -/- In order to analyze and compare the conception of conceptual change provided by these different models, I rely on several historical reconstructions of episodes of scientific conceptual change. The historical episodes of scientific change that figure in this work include the emergence of the morphological concept of fish in biological taxonomies, the development of scientific conceptions of temperature, the Church-Turing thesis and related axiomatizations of effective calculability, the history of the concept of polyhedron in 17th and 18th century mathematics, Hamilton’s invention of the quaternions, the history of the pre-abstract group concepts in 18th and 19th century mathematics, the expansion of Newtonian mechanics to viscous fluids forces phenomena, and the chemical revolution. I will also present five different formal and informal improvements of four specific models of conceptual change. I will first present two different improvements of Carnapian explication, a formal and an informal one. My informal improvement of Carnapian explication will consist of a more fine-grained version of the procedure that adds an intermediate, third step to the two steps of Carnapian explication. I will show how this novel three-step version of explication is more suitable than its traditional two-step relative to handle complex cases of explications. My second, formal improvement of Carnapian explication will be a full explication of the concept of explication itself within the theory of conceptual spaces. By virtue of this formal improvement, the whole procedure of explication together with its application procedures and its pragmatic desiderata will be reconceptualized as a precise procedure involving topological and geometrical constraints inside the theory of conceptual spaces. My third improved model of conceptual change will consist of a formal explication of Darwinian models of conceptual change that will make vast use of Godfrey-Smith’s population-based Darwinism for targeting explicitly mathematical conceptual change. My fourth improvement will be dedicated instead to Wilson’s indeterminate model of conceptual change. I will show how Wilson’s very informal framework can be explicated within a modified version of the structuralist model-theoretic reconstructions of scientific theories. Finally, the fifth improved model of conceptual change will be a belief-revision-like logical framework that reconstructs Thagard’s model of conceptual revolution as specific revision and contraction operations that work on conceptual structures. -/- At the end of this work, a general conception of conceptual change in science and philosophy emerges, thanks to the combined action of the three layers of my methodology. This conception takes conceptual change to be a multi-faceted phenomenon centered around the dynamics of groups of concepts. According to this conception, concepts are best reconstructed as plastic and inter-subjective entities equipped with a non-trivial internal structure and subject to a certain degree of localized holism. Furthermore, conceptual dynamics can be judged from a weakly normative perspective, bound to be dependent on shared values and goals. Conceptual change is then best understood, according to this conception, as a ubiquitous phenomenon underlying all of our intellectual activities, from science to ordinary linguistic practices. As such, conceptual change does not pose any particular problem to value-laden notions of scientific progress, objectivity, and realism. At the same time, this conception prompts all our concept-driven intellectual activities, including philosophical and metaphilosophical reflections, to take into serious consideration the phenomenon of conceptual change. An important consequence of this conception, and of the analysis that generated it, is in fact that an adequate understanding of the dynamics of philosophical concepts is a prerequisite for analytic philosophy to develop a realistic and non-idealized depiction of itself and its activities. (shrink)

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate ($\models^*$) appropriate to such structures. We indicate the utility of this theory as a framework for the development of the metatheory of first-order predicate logic and set theory, and we use it to prove that for any recursively enumerable extension $\Theta$ of ZF there is a finitely axiomatizable extension $\Theta'$ of GB that is a conservative extension of (...) $\Theta$. We also prove a conservative extension result that justifies the use of $\models^*$ to characterize ground models for forcing constructions. (shrink)

This thesis proposes and presents two new models for belief representation and belief revision. The first model is the B-structures model which relies on a notion of partial language splitting and tolerates some amount of inconsistency while retaining classical logic. The model preserves an agent's ability to answer queries in a coherent way using Belnap's four-valued logic. Axioms analogous to the AGM axioms hold for this new model. The distinction between implicit and explicit beliefs is represented and psychologically (...) plausible, computationally tractable procedures for query answering and belief base revision are obtained. ;The second model presents a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the conclusion and formulas in the sequence. The relevance relations are ternary as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely representable formalism and a plausible model of reasoning for automated agents. (shrink)

The theory of trees with additional unary predicates and quantification over nodes and branches embraces a rich branching time logic. This theory was reduced in the companion paper to the first-order theory of binary, bounded, well-founded trees with additional unary predicates. Here we prove the decidability of the latter theory.

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is ${\Sigma _{1}^{1}}$ or ${\Pi _{1}^{1}}$ , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two ${\Pi _{1}^{1}}$ sets. Our main result (...) is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove the corresponding result for antichains. Finally, we prove that if a computable partial ordering ${\mathcal{A}}$ has the feature that for every ${\mathcal{B} \cong \mathcal{A}}$ , there is an infinite chain or antichain that is ${\Delta _{2}^{0}}$ relative to ${\mathcal{B}}$ , then we have uniform dichotomy: either for all copies ${\mathcal{B}}$ of ${\mathcal{A}}$ , there is an infinite chain that is ${\Delta _{2}^{0}}$ relative to ${\mathcal{B}}$ , or for all copies ${\mathcal{B}}$ of ${\mathcal{A}}$ , there is an infinite antichain that is ${\Delta _{2}^{0}}$ relative to ${\mathcal{B}}$. (shrink)

Johnson -Laird has argued that spatial reasoning is based on the construction and manipulation of mental models in memory. The present article addresses the question of whether reasoning about time relations is constrained by the same factors as reasoning about spatial relations. An experiment is reported that explored the similarities and the differences in the performance of subjects in comparable spatial and temporal reasoning tasks. The results indicated that, in both the temporal and the spatial content domains, the (...) data were in agreement with the view that subjects solved problems by constructing models in memory rather than with a logical rule conceptualisation of reasoning. An analysis of the premise-reading times on the basis of premise-linking order provided support for an on-line process of mental models construction, and offered an explanation for the finding that spatial problems that did require an inference of transitivity were easier than problems that did not. No essential differences in processing and performance were observed across the two content domains, although in the time domain the correctness data were in agreement with both the mental models theory and the logical rules view. The results are discussed with respect to the mental models theory and the structural characteristics of the problems. (shrink)

The logical theory of branching space-times, which is intended to provide a framework for studying objective indeterminism, remains at a certain distance from the discussion of space-time theories in the philosophy of physics. In a welcome attempt to clarify the connection, Earman has recently found fault with the branching approach and suggested ``pruning some branches from branching space-time''. The present note identifies the different---order theoretic vs. topological---points of view of both discussion as a reason (...) for certain misunderstandings, and tries to remove them. Most importantly, we give a novel, topological criterion of modal consistency that usefully generalizes the order-theoretic criterion of directedness, and we introduce a differential-geometrical version of BST based on the theory of non-Hausdorff manifolds. (shrink)

This book presents a new theory of the relationship between vagueness, context-sensitivity, gradability, and scale structure in natural language. Heather Burnett argues that it is possible to distinguish between particular subclasses of adjectival predicatesDLrelative adjectives like tall, total adjectives like dry, partial adjectives like wet, and non-scalar adjectives like hexagonalDLon the basis of how their criteria of application vary depending on the context; how they display the characteristic properties of vague language; and what the properties of their associated orders (...) are. It has been known for a long time that there exist empirical connections between context-sensitivity, vagueness, and scale structure; however, a formal system that expresses these connections had yet to be developed. This volume sets out a new logical system, called DelTCS, that brings together insights from the Delineation Semantics framework and from the Tolerant, Classical, Strict non-classical framework, to arrive at a full theory of gradability and scale structure in the adjectival domain. The analysis is further extended to examine vagueness and gradability associated with particular classes of determiner phrases, showing that the correspondences that exist between the major adjectival scale structure classes and subclasses of determiner phrases can also be captured within the DelTCS system. (shrink)

This work aims to make tense logic a more robust tool for ontologists, philosophers, knowledge engineers and programmers by outlining a fusion of tense logic and ontology of time. In order to make tense logic better understandable, the central formal primitives of standard tense logic are derived as theorems from an informal and intuitive ontology of time. In order to make formulation of temporal propositions easier, temporal operators that were introduced by Georg Henrik von Wright are (...) developed, and mapped to the ontology of time. (shrink)

Branching time is a popular theory of time that is intended to account for the openness of the future. Generally, branching-time models the openness of the future by positing a multiplicity of concrete alternative futures mirroring all the possible ways the future could unfold. A distinction is drawn in the literature among branching-time theories: those that make use of moment-based structures and those that employ history-based ones. In this paper, I introduce and (...) discuss a particular kind of openness relative to the possibility that time ends (doomsday). I then show that whereas moment-based branching structures cannot represent this kind of openness, history-based structures can account for it. The conclusion is that history-based structures have an advantage over moment-based ones. (shrink)

This paper gives a new, proof-theoretic explanation of partial-order reasoning about time in a nonmonotonic theory of action. The explanation relies on the technique of lifting ground proof systems to compute results using variables and unification. The ground theory uses argumentation in modal logic for sound and complete reasoning about specifications whose semantics follows Gelfond and Lifschitz’s language. The proof theory of modal logic A represents inertia by rules that can be instantiated by sequences of time (...) steps or events. Lifting such rules introduces string variables and associates each proof with a set of string equations; these equations are equivalent to a set of partial-order tree-constraints that can be solved efficiently. The defeasible occlusion of inertia likewise imposes partial-order constraints in the lifted system. By deriving an auxiliary partial order representation of action from the underlying logic, not the input formulas or proofs found, this paper strengthens the connection between practical planners and formal theories of action. Moreover, the general correctness of the theory of action justifies partial-order representations not only for forward reasoning from a completely specified start state, but also for explanatory reasoning and for reasoning by cases. (shrink)

In this paper I analyze the temporal structures that are appropriate to study the notion of point of view. When we analyze the points of view and their structure, it seems clear that we must take into account the time t in which a point of view is attributed to a subject. A two-dimensional temporal logic which combines a modal dimension for possibilities and a temporal one for the flow of time, offers a clear view of the temporary (...) location of a point of view. In this logic, we have histories, thanks to the temporal dimension, and evaluation is in two indices, time and history. These stories can be seen as different scenarios, providing a clear advantage when applying to the analysis of the notion of point of view. The conclusion is that, in order to give a proper approach for the notion of point of view, all these aspects should be combined. (shrink)

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

We present a variant of ATL with incomplete information which includes the distributed knowledge operators corresponding to synchronous action and perfect recall. The cooperation modalities assume the use the distributed knowledge of coalitions and accordingly refer to perfect recall incomplete information strategies. We propose a model-checking algorithm for the logic. It is based on techniques for games with imperfect information and partially observable objectives, and involves deciding emptiness for automata on infinite trees. We also propose an axiomatic system and prove (...) its completeness for a rather expressive subset. As for the constructs left outside this completely axiomatised subset, we present axioms by which they can be defined in the subset on the class of models in which every state has finitely many successors and give a complete axiomatisation for a “flat” subset of the logic with these constructs included. (shrink)

We make a proposal for formalizing simultaneous games at the abstraction level of player's powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of 'concurrent game logic' CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

Mares and Goldblatt, 163–187, 2006) provided an alternative frame semantics for two quantified extensions of the relevant logic R. In this paper, I show how to extend the Mares-Goldblatt frames to accommodate identity. Simpler frames are provided for two zero-order logics en route to the full logic in order to clarify what is needed for identity and substitution, as opposed to quantification. I close with a comparison of this work with the Fine-Mares models for relevant (...) class='Hi'>logics with identity and a discussion of constant and variable domains. (shrink)

The seventeenth century Muslim philosopher Muhammad Sadr al-Din Shirazi, known as Mulla Sadra, introduced the idea of substantial motion in Islamic philosophy. This view is characterized by a continuity criterion for diachronic identity, a four-dimensional view of individual substances, the notion that possibilities change, and the continual creation of all creatures. Modern philosophical logic provides means to model a variety of claims about individuals, substances, modality and time. In this paper, the semantics of formal systems discussed by Carnap, Bressan (...) and Gupta are reviewed with regard to the issue of substance and identity. Next a model introduced by Storrs McCall is described that is able to build upon and yet resolve some of the issues about substance and identity as characterized by Bressan and others. McCall’s model is also shown to be able to provide an illustration of Mulla Sadra’s doctrine of substantial motion. (shrink)

This article takes off from Johan van Benthem’s ruminations on the interface between logic and cognitive science in his position paper “Logic and reasoning: Do the facts matter?”. When trying to answer Van Benthem’s question whether logic can be fruitfully combined with psychological experiments, this article focuses on a specific domain of reasoning, namely higher-order social cognition, including attributions such as “Bob knows that Alice knows that he wrote a novel under pseudonym”. For intelligent interaction, it is important that (...) the participants recursively model the mental states of other agents. Otherwise, an international negotiation may fail, even when it has potential for a win-win solution, and in a time-critical rescue mission, a software agent may depend on a teammate’s action that never materializes. First a survey is presented of past and current research on higher-order social cognition, from the various viewpoints of logic, artificial intelligence, and psychology. Do people actually reason about each other’s knowledge in the way proscribed by epistemic logic? And if not, how can logic and cognitive science productively work together to construct more realistic models of human reasoning about other minds? The paper ends with a delineation of possible avenues for future research, aiming to provide a better understanding of higher-order social reasoning. The methodology is based on a combination of experimental research, logic, computational cognitive models, and agent-based evolutionary models. (shrink)

This article takes off from Johan van Benthem’s ruminations on the interface between logic and cognitive science in his position paper “Logic and reasoning: Do the facts matter?”. When trying to answer Van Benthem’s question whether logic can be fruitfully combined with psychological experiments, this article focuses on a specific domain of reasoning, namely higher-order social cognition, including attributions such as “Bob knows that Alice knows that he wrote a novel under pseudonym”. For intelligent interaction, it is important that (...) the participants recursively model the mental states of other agents. Otherwise, an international negotiation may fail, even when it has potential for a win-win solution, and in a time-critical rescue mission, a software agent may depend on a teammate’s action that never materializes. First a survey is presented of past and current research on higher-order social cognition, from the various viewpoints of logic, artificial intelligence, and psychology. Do people actually reason about each other’s knowledge in the way proscribed by epistemic logic? And if not, how can logic and cognitive science productively work together to construct more realistic models of human reasoning about other minds? The paper ends with a delineation of possible avenues for future research, aiming to provide a better understanding of higher-order social reasoning. The methodology is based on a combination of experimental research, logic, computational cognitive models, and agent-based evolutionary models. Keywords Epistemic logic - Cognitive science - Intelligent interaction - Cognitive modeling. (shrink)

After the three families divided up the state of Jin and the Tian family took over Qi, the political situation in the fourth century B.C.E. appeared even more chaotic. Wei conquered Chu's Luyang and Qin's Xihe, Qin defeated Wei at Shimen , and again at Shaoliang , and Wei moved its capital to Daliang. During the mid-Warring States period, Qin became dominant in the west, Qi in the east, Chu in the south, and Wei in the center. Rapid changes occurred (...) one after another; trickery and conflict were rampant. However, the shi , the intelligentsia, actually managed to expand their spheres of existence and activity accordingly in this state of tension between countries, states, and men. A few major states assembled quite a number of literati; and those men of the villages, who had in earlier times merely waited passively for opportunities to fall into their laps, crisscrossed the various feudal states; literati who previously had no cause to use military force became, one by one, the honored guests of the feudal lords. With the breakdown of the previously simple and obvious order, the gradually dismantling of the common body of the ancestral clan of the past, and the increasing complexities of social relationships after the dissolution of blood ties, social order became a matter of concern. Or, to reword this most practical issue: How could this universally chaotic society go from disorder to order? (shrink)

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Alternating-time (...) Temporal Logic (ATL). The key insight in ATL is that the path quantifiers of CTL could be replaced by cooperation modalities, of the form , where is a set of agents. The intended interpretation of an ATL formula is that the agents can cooperate to ensure that holds (equivalently, that have a winning strategy for ). In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as group can cooperate to bring about iff it is common knowledge in that . The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial (...) orders (\nsbcdt\ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

We show how to build various models of first-order theories, which also have properties like: tree with only definable branches, atomic Boolean algebras or ordered fields with only definable automorphisms. For this we use a set-theoretic assertion, which may be interesting by itself on the existence of quite generic subsets of suitable partial orders of power λ + , which follows from ♦ λ and even weaker hypotheses . For a related assertion, which is equivalent to the (...) morass see Shelah and Stanley [16]. The various specific constructions serve also as examples of how to use this set-theoretic lemma. We apply the method to construct rigid ordered fields, rigid atomic Boolean algebras, trees with only definable branches; all in successors of regular cardinals under appropriate set- theoretic assumptions. So we are able to answer the following algebraic question. Saltzman's Question . Is there a rigid real closed field, which is not a subfield of the reals? (shrink)

In the tree-like representation of Time, two histories are undivided at a moment t whenever they share a common moment in the future of t. In the present paper, it will first be proved that Ockhamist and Peircean branching-time logics are unable to express some important sentences in which the notion of undividedness is involved. Then, a new semantics for branching-time logic will be presented. The new semantics is based on trees endowed with an (...) indistinguishability function, a generalization of the notion of undividedness. It will be shown that Ockhamist and Peircean semantics can be viewed as limit cases of the semantics developed in this paper. (shrink)

The article discusses the relation between two intuitive properties of time, namely its flow and branching. Both properties are introduced first in an informal way and compared. The conclusion of this informal analysis is that the two properties do not entail each other nor are they in contradiction. In order to verify this, we briefly introduced the branching temporal structures called branching space-time, branching continuation and their versions Minkowski branching structure and (...) class='Hi'>branching time with Instants. Two possible ways how to formalize flow of time are given, one based on the definition of flow of time from temporal logics and the other based on relativistic physics. The latter is used to define flow of time with the use of linearly ordered points on worldines while respecting the ontological definiteness given by the difference of the past and the future. This is formalized in each of the branching models and it is concluded by comparing the resulting properties that branching and flow, even in the formal sense, do not entail each other. However, notions connected with flow of time represent a useful basis for semantics of the branching models. (shrink)

Temporal logic is one of the many areas in which a possible world semantics is adopted. Prior's Ockhamist and Peircean semantics for branching-time, though, depart from the genuine Kripke semantics in that they involve a quantification over histories, which is a second-order quantification over sets of possible worlds. In the paper, variants of the original Prior's semantics will be considered and it will be shown that all of them can be viewed as first-order counterparts of the (...) original semantics. (shrink)

What makes a visually appealing landscape? How can the design and use of a landscape be harmonised? In this significantly revised and updated third edition of Simon Bell's seminal text, he further explores the answers to these questions by interrogating a range of design principles, applications and ideas. Written for students, instructors and professionals, the book unveils a visual design vocabulary for anyone involved with landscape aesthetics including landscape architects, architects, planners, urban designers, landscape managers, foresters, geographers and ecologists. Structured (...) around key design terms, which are explained and illustrated using an extensive range of examples from around the world, including North America, Europe and Asia, this book enables you to describe, debate and design the visual landscape. It starts with basic elements, before moving onto variable design components, and then the ways these elements are organized into compositions, in order to demonstrate how landscapes are created and how meanings and patterns are perceived within them. This new full colour edition contains over 240 images; an updated introduction; examples from China, Vietnam, and central Asia; a chapter on how to read and understand visual design elements in the landscape; a teaching model for instructors; and expanded appendix materials including a glossary, references and further reading. (shrink)

Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as "Alternating-time (...) Temporal Logic". The key insight in ATL is that the path quantifiers of CTL could be replaced by "cooperation modalities", of the form $\langle \langle \Gamma \rangle \rangle $, where Γ is a set of agents. The intended interpretation of an ATL formula $\langle \langle \Gamma \rangle \rangle \varphi $ is that the agents Γ can cooperate to ensure that φ holds. In this paper, we extend ATL with knowledge modalities, of the kind made popular in the work of Fagin, Halpern, Moses, Vardi and colleagues. Combining these knowledge modalities with ATL, it becomes possible to express such properties as "group Γ can cooperate to bring about φ iff it is common knowledge in Γ that ψ". The resulting logic -- Alternating-time Temporal Epistemic Logic -- shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems. (shrink)

In this paper we address the modelling of reasoning processes in natural agents. We focus on a very basic kind of non-monotonic inference for which we identify a simple and plausible underlying process, and we develop a family of logical models that allow to match this process. Partial worlds models, as we call them, are a variant of Kraus, Lehmann and Magidor’s cumulative models. We show that the inference relations they induce form a strict subclass of (...) cumulative relations and tackle the issue of providing sound and complete sets of rules to characterise them. Taking inspiration from the work of Gabbay and Schlechta, we analyse the question in terms of definable sets of partial worlds and conclude that completeness is probably unreachable using a standard propositional language. This brings us to enrich our language with an additional connective, which makes it possible to distinguish between two kinds of disjunction in the partial worlds context. Within this renewed framework, we provide two representation theorems: one for inference relations induced by precisification-free smooth models, and the other for inference relations induced by precisification-free ranked models. Finally we give an aperçu of how partial worlds models lend themselves to the modelling of learning. (shrink)

Biró, B. and I. Sain, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, Annals of Pure and Applied Logic 63 201-225. We show that one can prove the partial correctness of more programs using Peano's axioms for the time frames of three-sorted time models than using only Presburger's axioms, that is it is useful to allow multiplication of time points at program verification and in (...) dynamic and temporal logics. We organized the paper as follows: 1. Preliminaries, 2. The main result, 3. Peano arithmetic with bounded multiplication, 4. Connections with temporal logics and dynamic logics, Acknowledgements, References. (shrink)

In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in [22] and [11]. We prove a characterization theorem for negatable formulas in independence logic and negatable sentences in dependence logic, and identify an interesting class of formulas that are negatable in independence logic. Dependence and independence atoms, first-order formulas belong to this class. We also demonstrate our extended system of independence logic by giving (...) explicit derivations for Armstrong's Axioms and the Geiger-Paz-Pearl axioms of dependence and independence atoms. (shrink)

We aim to show that Kant’s theory of time is consistent by providing axioms whose models validate all synthetic a priori principles for time proposed in the Critique of Pure Reason. In this paper we focus on the distinction between time as form of intuition and time as formal intuition, for which Kant’s own explanations are all too brief. We provide axioms that allow us to construct ‘time as formal intuition’ as a pair of (...) continua, corresponding to time as ‘inner sense’ and the external representation of time as a line Both continua are replete with infinitesimals, which we use to elucidate an enigmatic discussion of ‘rest’ in the Metaphysical foundations of natural science. Our main formal tools are Alexandroff topologies, inverse systems and the ring of dual numbers. (shrink)

Clausal complements of different kinds of attitude verbs such as believe, doubt, be surprised, wonder, say, and whisper behave differently semantically in a number of respects. For example, they differ in the inference patterns they display. This paper develops a semantic account of clausal complements using partial logic which accounts for such semantic differences on the basis of a uniform meaning of clauses. It focuses on explaining the heterogeneous inference patterns associated with different kinds of attitude verbs, but it (...) contributes also to explaining differences among clausal complements of attitude verbs regarding the possibility of de re reference, anaphora support, presupposition satisfaction, and the distribution of subjunctive in certain languages. Moreover, it gives a new account of factivity. The point of departure of this paper is the general observation that the failure of inferences from attitude reports is relative in that it depends both on the general type of attitude and on the particular instance of the attitude described. Thus, from John is surprised that P and Q one cannot infer John is surprised that P and John is surprised that Q, though this is possible with believe. Conversely, one can infer from John believes that P and John believes that Q, to John believes that P and Q, but only as long as the same belief state of John is involved. In order to capture this dependency of inferences from attitude reports on a particular mental state or act, I propose an account on which clausal complements of attitude verbs (as well as independent sentences) characterize the intentional state or act described by the attitude verb in question, rather than referring to independent propositions. The semantic account of attitude reports of this paper can hence be called an 'event-based account' of clauses. Formally, the denotation of any sentence, both independent and embedded, is construed as a function mapping an intentional state or act to a function from situations (which form the content of the state or act) to truth values.. (shrink)

I discuss a model inspired from the string/brane framework, in which our Universe is represented (after perhaps appropriate compactification) as a three brane, propagating in a bulk space time punctured by D0-brane (D-particle) defects. As the D3-brane world moves in the bulk, the D-particles cross it, and from an effective observer on D3 the situation looks like a “space-time foam” with the defects “flashing” on and off (“D-particle foam”). The open strings, with their ends attached on the brane, (...) which represent matter in this scenario, can interact with the D-particles on the D3-brane universe in a topologically non-trivial manner, involving splitting and capture of the strings by the D0-brane defects. Such processes are consistently described by logarithmic conformal field theories on the world-sheet of the strings. Physically, they result in effective decoherence of the string matter on the D3 brane, and as a result, of CPT Violation, but of a type that implies an ill-defined nature of the effective CPT operator. Due to electric charge conservation, only electrically neutral (string) matter can exhibit such interactions with the D-particle foam. This may have unique, experimentally detectable (in principle), consequences for electrically-neutral entangled quantum matter states on the brane world, in particular the modification of the pertinent Einstein-Podolsky-Rosen (EPR) Correlation in neutral mesons in an appropriate meson factory. For the simplest scenarios, the order of magnitude of such effects might lie within the sensitivity of upgraded φ-meson factories. (shrink)

In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first-order logic. This reduction is then used to single out a number of decidable fragments of first-order temporal (...) logics and of two-sorted first-order logics in which one sort is intended for temporal reasoning. Besides standard first-order time structures, we consider also those that have only finite first-order domains, and extend the results mentioned above to temporal logics of finite domains. We prove decidability in three different ways: using decidability of monadic second-order logic over the intended flows of time, by an explicit analysis of structures with natural numbers time, and by a composition method that builds a model from pieces in finitely many steps. (shrink)